منابع مشابه
Optimally Competitive List Batching
Batching has been studied extensively in the offline case, but applications such as manufacturing or TCP acknowledgment often require online solutions. We consider online batching problems, where the order of jobs to be batched is fixed and where we seek to minimize the sum of the completion times of the jobs. We present optimally competitive online algorithms for both s-batch and p-batch probl...
متن کاملA Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
We consider the online list s-batch problem, where all the jobs have processing time 1 and we seek to minimize the sum of the completion times of the jobs. We give a Java program which is used to verify that the competitiveness of this problem is 619 583 .
متن کاملOptimally solving the joint order batching and picker routing problem
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...
متن کاملSPT is optimally competitive for uniprocessor flow
We show that the Shortest Processing Time (SPT) algorithm is (∆ + 1)/2-competitive for nonpreemptive uniprocessor total flow time with release dates, where ∆ is the ratio between the longest and shortest job lengths. This is best possible for a deterministic algorithm and improves on the (∆ + 1) competitive ratio shown by Epstein and van Stee using different methods.
متن کاملA Competitive Analysis of the List Update
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present request to be served but also some future requests? We introduce two diierent models of lookahead and study the list update problem using these models. We develop lower bounds on the competitiveness that can be achieved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.04.011